Performance of Work-Optimal PRAM Simulation Algorithms on Coated Meshes
نویسنده
چکیده
We study the eeect of varying the multithreading level of processors in work-optimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P pro-cessor&memory pairs that form a coat on the routing machinery. The algorithms studied are based on greedy routing, sorting, improved virtual leveled network technique, combining queues method, and synchronization wave. Our results show that increasing the multithreading level considerably improves the simulation cost. The cost can be decreased below 5 routing steps per P simulated PRAM processors. In case of one algorithm, even costs 1:1 : : :2 are achieved.
منابع مشابه
Experimental Results for Four Work-Optimal PRAM Simulation Algorithms on Coated Meshes
In this paper we consider the eeect of overloading in four work-optimal PRAM simulation algorithms on coated meshes with P real processors. A coated mesh consists of a mesh connected routing machinery, and processor&memory pairs, which form a coat on the routing machinery. Previously work-optimal PRAM simulations, which ignore the eeect of overloading, has been presented for coated meshes, but ...
متن کاملWork-Optimal Simulation of PRAM Models on Meshes
In this paper we consider work-optimal simulations of PRAM models on coated meshes. Coated meshes consist of a mesh connected routing machinery with processors on the surface of the mesh. We prove that coated meshes with 2-dimensional or 3-dimensional routing machinery can work-optimally simulate EREW, CREW, and CRCW PRAM models. The general idea behind this simulation is to use Valiant's XPRAM...
متن کاملEecient Two-level Mesh Based Simulation of Prams
We consider time-processor optimal simulations of PRAM models on coated block meshes. A coated block mesh consists of-processor blocks and or p p p router blocks. The router blocks form a 2-dimensional or a 3-dimensional regular mesh, and the processor&memory blocks are located on the surface of the block mesh. As a generalization of the coated mesh, the 2-dimensional and 3-dimensional coated b...
متن کاملOn Implementing EREW Work-Optimally on Mesh of Trees
We show how to implement an `1 n log n-processor EREW PRAM workoptimally on a 2-dimensional n-sided mesh of trees, consisting of n processors, n memory modules, and O(n) nodes. Similarly, we prove that an `2 n log n-processor EREW PRAM can be implemented work-optimally on a 3-dimensional n-sided mesh of trees. By the work-optimality of implementations we mean that the expected routing time of P...
متن کاملOn Implementing EREW Work-Optimally on Mesh of Trees
We show how to implement an`1 nlog n-processor EREW PRAM work-optimally on a 2-dimensional n-sided mesh of trees, consisting of n processors, n memory modules, and O(n 2) nodes. Similarly, we prove that an`2 n 2 log n-processor EREW PRAM can be implemented work-optimally on a 3-dimensional n-sided mesh of trees. By the work-optimality of implementations we mean that the expected routing time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 38 شماره
صفحات -
تاریخ انتشار 1995